Global Dynamic Path Planning Fusion Algorithm Combining Jump-A* Algorithm and Dynamic Window Approach

نویسندگان

چکیده

In order to meet the performance requirements of global optimality and path smoothness in robot planning, a new fusion algorithm jump-A* dynamic window approach is proposed. First, A* optimized by using jump point search method distance evaluation function defined Manhattan Euclidean obtain information. Then take as core integrating information safely plan optimal with high smoothness. The experimental results show that proposed this paper can not only effectively solve problem non-continuous curvature excessive turning angle at points planned algorithm, but also improve optimality. This research beneficial motion control robots has certain reference for navigation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A set-based global dynamic window algorithm for robust and safe mobile robot path planning

In recent papers we proposed a novel approach for mobile robot localization based on set theoretic methods. In this paper we complete this set-based approach by introducing a novel set-based mobile robot path planning algorithm, which can handle the outputs of the set-based localization. In opposite to most known path planning algorithms the approach considers not only kinematic and dynamic con...

متن کامل

A Multi-stage Probabilistic Algorithm for Dynamic Path-Planning

Probabilistic sampling methods have become very popular to solve single-shot path planning problems. Rapidlyexploring Random Trees (RRTs) in particular have been shown to be efficient in solving high dimensional problems. Even though several RRT variants have been proposed for dynamic replanning, these methods only perform well in environments with infrequent changes. This paper addresses the d...

متن کامل

Path planning self-learning Algorithm for a dynamic changing environment

Safe and optimal path planning in a cluttered changing environment for agents’ movement is an area of research, which needs further investigations. The existing methods are able to generated secure trajectories, but they are not efficient enough to learn from their mistakes, especially when dynamics of the environment are concerned. This paper presents an advanced version of the Ant-Air algorit...

متن کامل

Elliptic net - a path planning algorithm for dynamic environments

Robot path planning and obstacle avoidance problems play an important role in mobile robotics. The standard algorithms assume that a working environment is static or changing slowly. Moreover, computation time and time needed for realization of the planned path is usually not crucial. The paper describes a novel algorithm that is focused especially to deal with these two issues: the presented a...

متن کامل

Mobile Robot Path Planning based on Dynamic Programming Algorithm

In order to meet the needs of mobile robots to make the global path planning based on a given environment information, related mathematical model was established, and simulation results were given by using the dynamic programming algorithm. In the road traffic path planning, master robot communicates with multiple slave robots through the server, and collects information from slave robots to ad...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3052865